Properties of variational estimates of a mixture model for random graphs

نویسندگان

  • Jean-Jacques Daudin
  • Alain Celisse
  • Steven Gazal
  • Stephane Robin
چکیده

Mixture models for random graphs have a complex dependency structure and a likelihood which is not computable even for moderate size networks. Variational and variational Bayes techniques are useful approaches for statistical inference of such complex models but their theoretical properties are not well known. We give a result about the consistency of variational estimates of the parameters of the model and we propose variational Bayes estimates. We compare the accuracy of the two variational methods through simulation studies and show an application to a large Protein-Protein interaction network.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Skew Laplace Finite Mixture Modelling

‎This paper presents a new mixture model via considering the univariate skew Laplace distribution‎. ‎The new model can handle both heavy tails and skewness and is multimodal‎. ‎Describing some properties of the proposed model‎, ‎we present a feasible EM algorithm for iteratively‎ ‎computing maximum likelihood estimates‎. ‎We also derive the observ...

متن کامل

Generating Realistic Labelled, Weighted Random Graphs

Generative algorithms for random graphs have yielded insights into the structure and evolution of real-world networks. Most networks exhibit a well-known set of properties, such as heavy-tailed degree distributions, clustering and community formation. Usually, random graph models consider only structural information, but many real-world networks also have labelled vertices and weighted edges. I...

متن کامل

A mixture model for random graphs

The Erdös–Rényi model of a network is simple and possesses many explicit expressions for average and asymptotic properties, but it does not fit well to real-world networks. The vertices of those networks are often structured in unknown classes (functionally related proteins or social communities) with different connectivity properties. The stochastic block structures model was proposed for this...

متن کامل

Convergence properties of a general algorithm for calculating variational Bayesian estimates for a normal mixture model

In this paper we propose a generalised iterative algorithm for calculating variational Bayesian estimates for a normal mixture model and we investigate its convergence properties. It is shown theoretically that the variational Bayes estimator converges locally to the maximum likelihood estimator at the rate of O(1/n) in the large sample limit. We also demonstrate by numerical experiments that t...

متن کامل

Gates: A graphical notation for mixture models

Gates are a new notation for representing mixture models and context-sensitive independence in factor graphs. Factor graphs provide a natural representation for message-passing algorithms, such as expectation propagation. However, message passing in mixture models is not well captured by factor graphs unless the entire mixture is represented by one factor, because the message equations have a c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010